Timing estimation of direct sequence spread spectrum communications systems over frequency-selective, slowly fading channels

ABSTRACT

Based on the MAP criterion, a category of optimal timing estimators is disclosed. These estimators work with known or unknown channel information, and with received information bits over frequency-selective, slowly fading channels. A sub-optimal timing estimator with a k-taps, multiplication-free, finite impulse response (FIR) filter is also disclosed, where k equals 22 when the Barker sequence of length  11  is employed. The sub-optimal estimator is robust with respect to frequency offset impairment. Using simulations, the disclosed timing estimators are demonstrated to be effective. However, in the special case of timing estimation without channel information, in a multi-path channel with a long delay spread, it is disclosed that it is more effective to estimate the received carrier phases and amplitudes of multi-paths before timing estimation.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to communications systems, and in particular, to transmissions over imperfect channels.

[0003] 2. Description of Related Art

[0004] When a radio frequency communication signal is transmitted, it usually does not follow the straight line path from the sender to the receiver—unless, of course, the two are physically connected, say by a telephone wire. Instead, the signal typically radiates in all directions from the sender. Thus, while some of the radiated signal actually travels a straight line path to the receiver, other portions of the radiated signal may take a more circuitous route, perhaps being deflected off of some physical body en route to the receiver. Consequently, the different portions of the signal that eventually reach the receiver may not arrive simultaneously. This creates a type of distortion known as multi-path distortion. Multi-path distortion is characterized by the fact that multi-path copies of a signal arrive at a receiver, offset in time from each other.

[0005] Moreover, these various versions of the signal, and additional signals from sources other than the sender, may introduce interference that tends to distort the signal. The clarity of the signal may be further compromised if the receiver is moving relative to the sender.

[0006] A type of radio frequency communication signal that is often utilized is a spread spectrum signal. Spread spectrum signals differ fundamentally from AM or FM radio signals. On the one hand, AM and FM signals have their signal information encoded in a fixed bandwidth assigned to a radio frequency. On the other hand, spread spectrum signals spread the energy contained in a signal across the entire radio frequency spectrum. In addition, in the spread spectrum context multiple signals may co-exist across the radio frequency spectrum, without interfering with each other.

[0007] A spread spectrum signal appears as a slight increase in the noise floor, when received by an uncorrelated receiver such as is used to receive AM and FM signals. The signal is correlated to a prescribed code sequence in order to detect the signal.

[0008] In a direct sequence spread spectrum transmitter an information containing carrier is modulated by a repeating code sequence. The speed of the code sequence is the chipping rate—measured in chips per second (cps). At the receiver, information from the signal is recovered by multiplying the transmitted signal by a locally generated replica of the code sequence. The replica of the code sequence is applied to the received signal with a set timing relationship.

[0009] The circuitry in the receiver that extracts the desired signal is called a spread spectrum correlator. The correlator may be envisioned as a special type of matched filter. The filter only responds to signals encoded with a code that matches its own code, and the receiver is tuned to another signal by changing codes.

[0010] Spread spectrum demodulation has two main steps: removing the spectrum spreading modulation—a process known as dispreading—and demodulating the signal to extract its information content. Despreading is accomplished satisfactorily when timing synchronization of the spreading code between the transmitter and receiver is achieved. Synchronization has two components: the initial acquisition of timing information, and the tracking of the timing. Synchronization, or timing information, is typically transmitted with the information content of the signal, and may be affected by any distortion encountered.

[0011] One device that is used to help the receiver to home in on the signal is a training sequence. A training sequence is a predetermined signal that is regularly sent as a sort of reference. Thus, the receiver is set to expect that the training sequence has certain predetermined characteristics. If the receiver receives an uncorrupted training sequence, no adjustment to the receiving unit is necessary. However, if there is some deviation from what is expected in the training sequence, the receiver can be adjusted to correct for the error, thus ensuring that when the actual communication signal is sent, it is received without any problem.

[0012] It is desirable to use the characteristics of the transmission channel in providing a system and method of estimating timing information. This is especially desirable in frequency-selective, slowly fading channels.

[0013] The problem of synchronization of DSSS communications over frequency-selective, fading channels, has not been completely solved. In frequency-selective, fading channels—unlike AWGN channels—estimates of both the received carrier phases and the amplitudes of the multi-paths must be made, whereas phase and amplitude estimates are not utilized in the simpler AWGN model. Moreover, the mutual interference due to multi-paths further complicates the problem of timing recovery. Therefore, there is a significant need for a method and an apparatus that will solve the problem of synchronization in DSSS communications over frequency-selective, fading channels.

[0014] While it is useful to estimate the received time, carrier phases, and amplitudes of the factors listed above, the timing estimate tends to play a dominant role in synchronization. The dominance is because the received time provides important prior information that allows the estimation of the received carrier phases and amplitudes. Therefore, to provide improved synchronization in DSSS communications over frequency-selective, fading channels, there is a real need for a method and an apparatus to estimate the received time.

[0015] Thus, the embodiments of the present invention provide a method and an apparatus to estimate the received time, by solving the synchronization problem in DSSS communications over frequency-selective, fading channels.

SUMMARY OF THE INVENTION

[0016] An embodiment of the present invention provides a method and an apparatus for estimating the received time of a received signal.

[0017] Another embodiment of the present invention provides a method and an apparatus for estimating the received time of a received signal transmitted over frequency-selective, slowly fading channels.

[0018] Yet another embodiment of the present invention provides a method and an apparatus for estimating the received timing of a direct sequence spread spectrum communications system, over frequency-selective, slowly fading channels.

[0019] In certain embodiments of the present invention, optimal timing estimators are disclosed that can be used with either known or unknown channel information, and with received information bits over the frequency-selective, slowly fading channels based on a maximum, a posteriori, probability (MAP) criterion. In addition, an embodiment of the present invention introduces a sub-optimal timing estimator with a 22-taps, multiplication-free, finite impulse response (FIR) filter, which is also robust with respect to frequency offset impairment.

[0020] Through the use of simulations, all the timing estimators disclosed in the present invention, have been demonstrated to be effective.

[0021] While the present invention can be used either with or without channel information, there are natural limitations in estimating timing when the channel information in the multi-path channel with long delay spread is unknown. In this context it is better to estimate the received carrier phases and the amplitudes of the multi-paths first, and then to estimate the timing.

[0022] Many additional features and advantages of the present invention will become apparent to a person of ordinary skill in the art, based on the following discussion of the preferred embodiments. The discussion should, of course, be read in conjunction with the accompanying drawings.

DESCRIPTION OF THE DRAWINGS

[0023]FIG. 1 is a graph that shows the miss probabilities of a one-shot, optimal timing estimator for various multi-path, fading channels;

[0024]FIG. 2 is a block diagram of an optimal, one-shot, data-aided timing estimation without channel information;

[0025]FIG. 3 is a graph that shows simulation results for optimal timing estimation over multi-path, fading channels;

[0026]FIG. 4 shows examples that demonstrate the unfeasibility of timing estimation when receiving with a large L, over a long delay spread channel;

[0027]FIG. 5 is a graph that shows simulation results comparing optimal timing estimation, with and without channel information;

[0028]FIG. 6 is a graph that shows simulation results for optimal timing estimation without channel information;

[0029]FIG. 7 is a block diagram of an optimal, one-shot, joint timing estimation, with unknown channel information and received information bits;

[0030]FIG. 8 is a graph that shows simulation results for non-data-aided, optimal timing estimation without channel information;

[0031]FIG. 9 is a conceptual plot of a simplified, non-data-aided timing estimation;

[0032]FIG. 10 is a block diagram of a simplified realization of an optimal, one-shot, joint differential detection and timing estimation, without channel information;

[0033]FIG. 11 is a block diagram of a sub-optimal timing estimator with 2L, 22-taps, finite impulse response (FIR) filters;

[0034]FIG. 12 is a block diagram of a sub-optimal, one-shot timing estimator, without channel information, but with a $\text{1-correlator},{{{\text{and}\quad \gamma_{l}} = \frac{\sigma_{l}^{2}}{{2N_{o}W} + {{{\hat{p}}_{\tau}^{2}(l)}\sigma_{l}^{2}}}};}$

[0035]FIG. 13 is a graph that shows simulation results comparing 2L-correlator and 1-correlator estimators;

[0036]FIG. 14 is a graph of simulation results that show the impact of frequency offset impairment on 1-correlator timing estimation with 5-rays receiving; and

[0037]FIG. 15 is a graph of simulation results that show the impact of frequency offset impairment on 2L-correlator timing estimation with 5-rays receiving.

DETAILED DESCRIPTION OF THE INVENTION AND THE DRAWINGS

[0038] Lack of signal synchronization should be addressed if the full energy of a sent signal is to be captured by a receiver. The problem arises because of variations in the channel through which the signal passes. If the characteristics of the channel are known in advance, then suitable corrections for its imperfections may be made. Determining channel characteristics is more challenging when the nature of the channel is not well defined.

[0039] Central to the reconciliation of the variation among the various versions of the received signal is the estimation of their received times (throughout this disclosure the terms “received time” and “received timing” will be used interchangeably”). The received time is the time one of a plurality of multi-path signals takes to reach the receiver. Once the received times are known, or well estimated, the receiver can correlate the various versions of the signal and sum them together to produce a strong signal containing the full energy of the originally sent signal.

[0040] As a simplified example to illustrate the above concept, assume that the original signal radiating out from the transmitter splits and travels in two straight paths and that the first path directly connects the sender and the receiver—i.e. it is the path of minimum distance. Assume further that the second path is to a building off of which the signal is deflected to follow a new straight line to the receiver. This second path is then longer than the first path, and the portion of the signal following it will take longer to reach the receiver than the first did. Therefore, in order to combine the two portions of the signal to capture the full initial signal energy, it is crucial to know the difference in their travel times to the receiver. When the time difference is known, the second signal can be corrected to coincide with the first, and then the two can be combined.

[0041] Direct sequence spread spectrum (DSSS) communications systems seek to address the problem just described. DSSS systems are in widespread usage in cellular systems such as IS-95, cdma2000, and 4G cellular systems. DSSS systems are also applied to wireless local area networks (WLAN) and wireless personal area networks (WPAN). DSSS systems are popular because of their interference-rejection ability, inherited frequency diversity—used to combat channel fading impairment—and their capacity for multiple access. These merits of DSSS communications are primarily due to the fact that the transmitted signal is spread by its assigned signature sequence.

[0042] A note is in order on terminology. A channel code is a sequence coding on the transmitted information bits, and is used for error correction and protection. That is, the main use of this kind of code is to detect and correct errors when a small portion of the transmitted information bits is erroneously received. For example, block codes such as Reed-Solomon codes are channel codes.

[0043] On the other hand, a signature sequence, which is also known as a “spreading code,” or a “spreading sequence,” or a “direct sequence,” is a sequence used to spread the transmitted information bits in spread spectrum communications. The signature sequence can not detect or correct errors in the information bits the way a channel code can. However, by expanding the transmitted spectrum, the signature sequence can be used to mitigate narrow-band interference, though it is ineffective in combating additive white Gaussian noise.

[0044] Synchronization of received time, carrier phase, and amplitude, plays a central role in DSSS wireless communication systems. Indeed, synchronization is important to the success of DSSS communications systems, since the benefits derived from signature sequences are diminished if the received timing is erroneously estimated.

[0045] In addition to multi-path delays, noise within the path degrades timing estimation. Noise in a path may be modeled with a Gaussian model. In the particular case of an additive white Gaussian noise (AWGN) channel, several synchronization algorithms for DSSS communications have been studied.

[0046] Another factor that affects the determination of timing information over a channel, is the fact that a channel tends both to be frequency selective and to cause fading of a signal. A system and method that takes these factors into account will improve the recovery of timing information and signal reception.

[0047] The problem of synchronization of DSSS communications over frequency-selective, fading channels, has not been completely solved. In frequency-selective, fading channels—unlike AWGN channels—estimates of both the received carrier phases and the amplitudes of the multi-paths must be made, whereas phase and amplitude estimates are not utilized in the simpler AWGN model. Moreover, the mutual interference due to multi-paths further complicates the problem of timing recovery. Therefore, there is a significant need for a method and an apparatus that will solve the problem of synchronization in DSSS communications over frequency-selective, fading channels.

[0048] While it is useful to estimate the received time, carrier phases, and amplitudes of the factors listed above, the timing estimate tends to play a dominant role in synchronization. The dominance is because the received time provides important prior information that allows the estimation of the received carrier phases and amplitudes. Therefore, to provide improved synchronization in DSSS communications over frequency-selective, fading channels, there is a real need for a method and an apparatus to estimate the received time.

[0049] Thus, the embodiments of the present invention provide a method and an apparatus to estimate the received time, by solving the synchronization problem in DSSS communications over frequency-selective, fading channels.

[0050] To make the disclosure as clear as possible, the disclosure will proceed as follows: the signal model and the assumptions made in constructing the present invention will be explained in Section 1. Section 2 will relax the assumptions of Section 1, and focus on the development of an optimal timing estimation system and method based on the maximum, a posteriori, probability (MAP) criterion. In. Section 3, some simplification is made of the complex results of Section 2, in order to produce a sub-optimal, timing estimator. The validity of the estimator is established through simulations that were conducted by the inventors. The final, fourth section summarizes the conclusions.

[0051] The function of the present invention is to estimate the received time of a received signal, and this is done by maximizing the received energy contained in a received signal.

[0052] When the channel information is known beforehand, the received signal along a multi-path, is matched with a corresponding, locally generated signal, to produce an output signal—a timing candidate—from which a received timing recovery signal is derived. This is done over a plurality of multi-paths, i.e. each multi-path produces a timing recovery signal. Then the received time of the output timing recovery signal with maximum energy is the received time estimate.

[0053] In an alternative embodiment that estimates the received time without channel information, instead of trying to perfectly match the received signal with the locally generated signal, the optimal estimation actually collects the received energy on the multi-paths. Once again, the energy is maximized over the multi-paths to produce the received time.

[0054] In either case, the signal is received and run through a conventionally constructed correlator that correlates the received signal with a locally generated signal. The correlator can, for example, be comprised of conventionally constructed finite impulse response (FIR) filters.

[0055] Next, the output from the correlator is used to generate a real-valued signal. This is done for each of a plurality of multi-path signals, and a plurality of correlated output signals is linearly combined when coupled to a conventionally constructed, linear combination block that is coupled to the FIR filters. The linear combination is stored in conventionally constructed storage components—each storage component has a storage location that corresponds to a timing candidate.

[0056] Finally, a conventionally constructed selector coupled to the storage components, chooses one of a plurality of storage components having a maximum value of energy, and the timing candidate corresponding to that storage component is the one whose timing is taken as the received time.

[0057] With this explanatory preface, the details of the invention are now be presented.

[0058] 1. Signal Model and Assumptions

[0059] In the preferred embodiment of the present invention, timing estimations of direct sequence spread spectrum (DSSS) communications systems over frequency-selective, slowly fading channels are developed. As will be appreciated by those skilled in the art, the equations developed are capable of being directly implemented into digital signal processing (DSP) circuitry that directly applies the mathematical functions.

[0060] Without loss of generality, and to simplify the discussion, it is assumed that the transmitted signal is “binary phase-shift keying” (BPSK) modulated, which means that it can be written as:

[0061] ${\sum\limits_{m = 0}^{M - 1}\quad {{b(m)}{s_{tx}\left( {t - {mT}} \right)}}},$

[0062] where b(m)ε{±1} for m=0,1, . . . ,M−1, and b(m)=0 for m≠0,1, . . . ,M−1, are the transmitted information bits;

[0063] ${s_{tx}(t)} \equiv {\sum\limits_{n = 0}^{N_{c} - 1}\quad {{d(n)}{p_{tx}\left( {t - {nT}_{c}} \right)}}}$

[0064] is the transmitted signature waveform employed in the spread spectrum communications system; d(n)ε

for n=0,1 . . . ,N_(c)−1 is the employed signature sequence; ρ_(tx)(t)εL²(−∞,∞) is the transmitted pulse shape function; T is the symbol duration; and T_(c) is the chip duration.

[0065] While the signature sequences, d(n), are not required to be real-valued, they have been assumed to be real-valued because real-valued sequences such as the Barker sequence in IEEE 802.11 b and the Walsh-Hadamard sequences in IS-95 and cdma2000, are often utilized in practical applications. Nevertheless, all the proposed algorithms in the present invention are equally applicable to complex-valued signature sequences provided that suitable modifications known to those skilled in the art, are made.

[0066] As will be appreciated by those skilled in the art, since the transmitted signal is band-limited with a null-to-null bandwidth, W, the received low-pass, equivalent signal over the frequency-selective, slowly fading channels with total multi-path spread, T_(m), can be written as: $\begin{matrix} {{{r_{LP}(t)} = {{\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b(m)}{s_{rx}\left( {t - \overset{\sim}{\tau} - {m\quad T} - \frac{l}{W}} \right)}}} + {z_{LP}(t)}}},} & (1) \end{matrix}$

[0067] where L≡┌T_(m)W┐+1 is the number of multi-paths in this frequency-selective channel; {tilde over (ρ)}_(l) is a time-invariant, complex-valued, Gaussian random variable denoting the received amplitude and carrier phase of the lth multi-path (note that it is assumed that {tilde over (ρ)}_(l) is time-invariant throughout the transmission of length M since slowly fading channels are being considered); ${s_{rx}(t)} \equiv {\sum\limits_{n = 0}^{N_{c} - 1}\quad {{d(n)}{p_{rx}\left( {t - {nT}_{c}} \right)}}}$

[0068] is the received signature waveform; ρhd rx(t)εL²(−∞,∞) is the received pulse-shaped function; {tilde over (τ)} is the received timing; and z_(LP) (t) is a complex-valued, additive, white Gaussian noise (AWGN) process. The real and imaginary parts of {tilde over (ρ)}_(l) are independent, Gaussian random variables with mean 0 and variance σ_(l) ²/2 for l=0,1, . . . ,L−1. In particular, to simplify the discussion it is assumed that the received pulse function, ρ_(rx)(t), is a raised cosine function with a roll-off factor of 0 because in this case, W=2/T_(c), which agrees with the specifications in IEEE 802.11 b. In fact, all the derived algorithms in this disclosure are equally applicable to more general ρ_(rx)(t) provided that suitable modifications known to those skilled in the art, are made.

[0069] In the preferred embodiment of the present invention, the presence of ρ_(rx)(t) for t∉[0,T_(c)) is ignored, in order to simplify the development. This simplification does not lead to any loss of generality, since it tends to provide a good approximation of practical pulses for band-limited channels, such as root raised cosine functions.

[0070] 2. Optimal Timing Estimation of DSSS Communications Systems Over Frequency-selective, Slowly Fading Channels

[0071] (a) Optimal Timing Estimation With Known Channel Information And Known Training Sequences

[0072] To simplify the discussion in this section, known received amplitudes and known carrier phases of the multi-path channel (i.e. known {tilde over (ρ)}_(l) for l=0,1, . . . ,L−1) are assumed. In addition, a knowledge of a plurality of received information sequences (or training sequences) as is the case in many practical, wireless communications systems, is assumed. These assumptions will then be relaxed in subsections (b) and (c).

[0073] Because the null-to-null bandwidth of the received signal is 2/T_(c), the received, low-pass, equivalent signal, r_(LP)(t), is sampled at a rate of 2/T_(c), to avoid losing any information. According to the Nyquist criterion: $\begin{matrix} {\begin{matrix} {{r\left( {m,n,q} \right)} \equiv \quad {r_{LP}\left( {{m\quad T} + {n\quad T_{c}} + \frac{q\quad T_{c}}{2}} \right)}} \\ {= \quad {{\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b\left( {m - {\overset{\sim}{\alpha}}_{l,n,q}} \right)}{d\left( \left( {n - {\overset{\sim}{\beta}}_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - 1} \right)\frac{T_{c}}{2}} - \overset{\sim}{\tau}} \right)_{T_{c}} \right)}}} +}} \\ {\quad {{z\left( {m,n,q} \right)},}} \end{matrix}\text{where}} & (2) \\ \begin{matrix} {{\overset{\sim}{\alpha}}_{l,n,q} = \alpha} & {{{\text{if}\quad - {\alpha \quad T}} \leq {{n\quad T_{c}} + {\left( {q - l} \right)\frac{T_{c}}{2}} - \overset{\sim}{\tau}} < {{- \left( {\alpha - 1} \right)}T}};} \end{matrix} & (3) \\ \begin{matrix} {{\overset{\sim}{\beta}}_{l,q} = \beta} & {{{\text{if}\quad - {\beta \quad T_{c}}} \leq \left( {{\left( {q - l} \right)\frac{T_{c}}{2}} - \overset{\sim}{\tau}} \right)_{T} < {{- \left( {\beta - 1} \right)}T_{c}}};} \end{matrix} & (4) \end{matrix}$

${z\left( {m,n,q} \right)} \equiv {z_{LP}\left( {{m\quad T} + {n\quad T_{c}} + \frac{q\quad T\quad c}{2}} \right)}$

[0074] is a sequence of independent and identically distributed, Gaussian random variables whose real and imaginary parts are independent, Gaussian random variables with mean 0 and variance N₀W; N₀/2 is the two-sided, power spectral density of the AWGN noise; and (^(•))_(x) denotes (^(•)) mod x. The optimal timing estimation based on the maximum, a posteriori (MAP), probability criterion is therefore $\begin{matrix} {\begin{matrix} {{\hat{\tau}}_{opt} = \quad {\arg \underset{\tau}{\max \quad}{\Pr \left( {r\left( {m,n,q} \right)} \middle| \tau \right)}}} \\ {= \quad {\arg \quad {\max\limits_{\tau}{\sum\limits_{m}{\sum\limits_{n = 0}^{N_{c} - 1}\sum\limits_{q = 0}^{1}}}}}} \\ {\quad {{{Re}\left\{ {{r^{*}\left( {m,n,q} \right)}{\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b\left( {m - \alpha_{l,n,q}} \right)}{d\left( \left( {n - \beta_{l,q}} \right)_{N_{c}} \right)}\quad {p_{rx}\left( \left( {{\left( {q - l} \right)\frac{T_{c}}{2}} - \tau} \right)_{T_{c}} \right)}}}} \right\}},}} \end{matrix}\text{where}} & (5) \\ \begin{matrix} {\alpha_{l,n,q} = \alpha} & {{{\text{if}\quad - {\alpha \quad T}} \leq {{n\quad T_{c}} + {\left( {q - l} \right)\frac{T_{c}}{2}} - \tau} < {{- \left( {\alpha - 1} \right)}T}};} \end{matrix} & (6) \\ \begin{matrix} {\beta_{l,q} = \beta} & {{{\text{if}\quad - {\beta \quad T_{c}}} \leq \left( {{\left( {q - l} \right)\frac{T_{c}}{2}} - \tau} \right)_{T} < {{- \left( {\beta - 1} \right)}T_{c}}};} \end{matrix} & (7) \end{matrix}$

[0075] and the superscript * stands for complex conjugation.

[0076] The proposed scheme in (5) is based on the observation of M receiving symbols that are used to estimate the received time, {tilde over (τ)}, by matching the received, sampled sequence with different, locally generated sequences based on timing candidates, τ.

[0077] The MAP criterion applied here, arises from solving the following hypothesis test. Let N denote the number of timing candidates employed. Then the corresponding N-ary hypothesis testing formula is:

[0078] H₀ : received timing ({tilde over (τ)})=0 $\begin{matrix} H_{0} & : & \text{received~~timing} & \left( \overset{\sim}{\tau} \right) & = & 0 \\ H_{1} & : & \text{received~~timing} & \left( \overset{\sim}{\tau} \right) & = & \frac{T}{N} \\ \vdots & \quad & \vdots & \vdots & \quad & \vdots \\ H_{n} & : & \text{received~~timing} & \left( \overset{\sim}{\tau} \right) & = & \frac{n\quad T}{N} \\ \vdots & \quad & \vdots & \vdots & \quad & \vdots \\ H_{N - 1} & : & \text{received~~timing} & \left( \overset{\sim}{\tau} \right) & = & {\frac{\left( {N - 1} \right)T}{N}.} \end{matrix}$

[0079]  Let r(m,n,q) denote the samples of the received, low-pass, equivalent signal. Then the above hypothesis test is equivalent to: $\begin{matrix} {{H_{0}:{r\left( {m,n,q} \right)}} = {{\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b\left( {m - {\overset{\sim}{\alpha}}_{l,n,q}} \right)}{d\left( \left( {n - {\overset{\sim}{\beta}}_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - l} \right)\frac{T_{c}}{2}} - 0} \right)_{T_{c}} \right)}}} + {z\left( {m,n,q} \right)}}} \\ {{H_{1}:{r\left( {m,n,q} \right)}} = {{\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b\left( {m - {\overset{\sim}{\alpha}}_{l,n,q}} \right)}{d\left( \left( {n - {\overset{\sim}{\beta}}_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - l} \right)\frac{T_{c}}{2}} - \frac{T}{N}} \right)_{T_{c}} \right)}}} + {z\left( {m,n,q} \right)}}} \\ {\quad {\vdots \quad \vdots \quad \vdots \quad \vdots}} \\ {{H_{n}:{r\left( {m,n,q} \right)}} = {{\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b\left( {m - {\overset{\sim}{\alpha}}_{l,n,q}} \right)}{d\left( \left( {n - {\overset{\sim}{\beta}}_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - 1} \right)\frac{T_{c}}{2}} - \frac{n\quad T}{N}} \right)_{T_{c}} \right)}}} + {z\left( {m,n,q} \right)}}} \\ {\quad {\vdots \quad \vdots \quad \vdots \quad \vdots}} \\ {{{H_{N - 1}:{r\left( {m,n,q} \right)}} = {{\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b\left( {m - {\overset{\sim}{\alpha}}_{l,n,q}} \right)}{d\left( \left( {n - {\overset{\sim}{\beta}}_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - l} \right)\frac{T_{c}}{2}} - \frac{\left( {N - 1} \right)T}{N}} \right)_{T_{c}} \right)}}} + {z\left( {m,n,q} \right)}}},} \end{matrix}$

[0080] where z(m,n,q) is a sequence of independent and identically distributed, Gaussian random variables with mean 0 and variance N_(o)W.

[0081] When the received amplitudes and phases in the multi-path components, {tilde over (ρ)}_(l) are known to the receiver, the probability density function, r(m,n,q), of the received samples in each hypothesis, is a single function instead of a set of functions. Therefore, in this setting the problem reduces to a simple hypothesis test, and the MAP estimate of the received timing is the timing candidate with the maximum likelihood function, when it is assumed that the a priori distribution of {tilde over (τ)} is uniform over [0,T).

[0082] On the other hand, the one-shot realization, which estimates the received timing based on observing the samples within a symbol, can be written as: $\begin{matrix} {{{\hat{\tau}}_{opt}(m)} = {\arg \quad {\max\limits_{{\tau \in {\lbrack{0,T}}})}{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{Re}{\left\{ {{r^{*}\left( {m,n,q} \right)}{\sum\limits_{l = 0}^{L - 1}{\overset{\sim}{\rho}\quad {b\left( {m - \alpha_{l,n,q}} \right)}{d\left( \left( {n - \beta_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - 1} \right)\frac{T_{c}}{2}} - \tau} \right)_{T_{c}} \right)}}}} \right\}.}}}}}}} & (8) \end{matrix}$

[0083] The term “energy” usually refers to the square sum of the signal magnitude within a symbol. However, it can also be used to denote the sum of the signal magnitude within a symbol, and the real part of the correlated output. For example, in equation (8) above, the energy is the real part of the correlated signal, instead of the sum or the square sum of the signal magnitude.

[0084] Adopting the multi-path, channel model employed in IEEE 802.11a and IEEE 802.11b, a simulation was conducted to verify the performance of the present embodiment of a one-shot, optimal timing estimator. In this simulation, the employed signature sequence was the Barker sequence of length 11, and the ρ_(rx)(t) were assumed to be rectangular pulses with support [0,T_(c)). In addition, the number of timing candidates was 22 and the received time was assumed to be a discrete random variable, uniformly distributed over these 22 timing candidates.

[0085]FIG. 1 shows the miss probability of this proposed one-shot, optimal timing estimator for various multi-path channels. As can be seen in the figure, the channel with the largest delay spread outperformed the smaller ones. This superior performance is primarily due to the larger frequency-diversity provided by the multi-path channels with larger delay spread, and the larger frequency-diversity in turn is used to combat fading impairment. It is particularly noteworthy to observe the degradation of performance associated with the simulation curve with delay spread 300 nsec. This degradation is due to the receiving of 66 multi-paths with 7 rays.

[0086] At the beginning of the discussion of this subsection, knowledge of the received information sequences, the received amplitudes, and the carrier phases of the multi-paths, was temporarily assumed. These two assumptions will now be relaxed. First, in Subsection 2 (b) known received information sequences, but unknown channel information, shall be assumed. Then in Subsection 2 (c) it shall be assumed that both the received information sequence and the channel information are unknown.

[0087] (b) Optimal Timing Estimation With Known Received Information Sequence And Unknown Channel Information

[0088] When the received amplitudes and carrier phases of the multi-paths are unknown to the timing estimator, the optimal timing estimation based on the MAP criterion is derived according to a composite hypothesis test rather than the simple hypothesis test discussed above. Of course, the overall structure of the hypotheses is the same, but now the probability density function, r(m,n,q), of the received samples in each hypothesis, is a set of functions instead of a single function.

[0089] To be more precise, in this setting the unknown parameters {{tilde over (ρ)}_(l)|l=0,1, . . . ,L−1} can be modeled as complex-valued, Gaussian random variables. Then the probability density function in each hypothesis is a set of functions indexed by the parametric set, Φ≡{{tilde over (ρ)}_(l)|l=0,1, . . . ,L−1}, instead of a single function. For example, the probability density function, r(m,n,q), of the received samples in the null hypothesis, H₀, is the set {Pr(r(m, n, q)|τ=0,ρ₀,ρ₁, . . . ,ρ_(L−1)), where {ρ₀,ρ₁, . . . ,ρ_(L−1)}εΦ}.

[0090] Therefore the hypothesis test in this case is a composite one, and the optimal timing estimate based on the MAP criterion is calculated by maximizing the likelihood function averaged over the parametric set Φ.

[0091] Thus, the way composite hypothesis testing is used to estimate the received time without channel information, is first to average the likelihood function over the unknown parameters, and then to choose the timing candidate with maximum likelihood. That is, $\begin{matrix} \begin{matrix} {{{\hat{\tau}}_{non}(m)} = \quad {\arg \quad {\max\limits_{{\tau \in {\lbrack{0,T}}})}{\Pr \left( {r\left( {m,n,q} \right)} \middle| \tau \right)}}}} \\ {= \quad {\arg \quad {\max\limits_{{\tau \in {\lbrack{0,T}}})}{\int{\int{\ldots {\int{\Pr\left( {\left. {r\left( {m,n,q} \right)} \middle| \tau \right.,\rho_{0},{\rho_{1\quad}\cdots},} \right.}}}}}}}} \\ {{{\quad \left. \rho_{L - 1} \right)}\quad {\prod\limits_{t = 0}^{L - 1}{{p\left( \rho_{l} \right)}{\rho_{0}}{\rho_{1}}\quad \cdots \quad {\rho_{L - 1}}}}},} \end{matrix} & (9) \end{matrix}$

[0092] where ρ(ρ_(l)) is the probability density function of {tilde over (ρ)}_(l).

[0093] The corresponding optimal, one-shot timing estimator without channel information, is: $\begin{matrix} {{{{\hat{\tau}}_{non}(m)} = {\arg \quad {\max\limits_{\tau \in {\lbrack{O,T})}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r\left( {m,n,q} \right)}{{\hat{s}}_{l}^{(\tau)}\left( {m,n,q} \right)}}}}}^{2}{\hat{\sigma}}_{l}^{2}}}}}},\text{where}} & (10) \\ {{{s_{l}^{(\tau)}\left( {m,n,q} \right)} \equiv {{b\left( {m - \alpha_{l,n,q}} \right)}{d\left( \left( {n - \beta_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - 1} \right)\frac{T_{c}}{2}} - \tau} \right)_{T_{c}} \right)}}}\quad {{l = 0},1,\cdots \quad,{{L - 1};}}} & (11) \\ {{{{p_{\tau}^{2}(l)} \equiv {\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{p_{rx}^{2}\left( \left( {{\left( {q - 1} \right)\frac{T_{c}}{2}} - \tau} \right)_{T_{c}} \right)}\quad l}}}} = 0},1,\cdots \quad,{{L - 1};}} & (12) \\ {{{{\hat{\sigma}}_{l}^{2} \equiv {\frac{\sigma_{l}^{2}}{1 + \frac{{{\hat{p}}_{\tau}^{2}(l)}\sigma_{l}^{2}}{2N_{0}W}}\quad l}} = 0},1,\cdots \quad,{{L - 1};}} & (13) \\ \left\{ {{{\begin{matrix} {{{\hat{s}}_{0}^{(\tau)}\left( {m,n,q} \right)} \equiv {s_{0}^{(\tau)}\left( {m,n,q} \right)}} \\ {{{\hat{s}}_{l}^{(\tau)}\left( {m,n,q} \right)} \equiv {{s_{l}^{(\tau)}\left( {m,n,q} \right)} - {\sum\limits_{i = 0}^{l - 1}{{R_{\tau}\left( {i,l} \right)}\quad \frac{{\hat{\sigma}}_{i}^{2}}{2N_{0}W}{{\hat{s}}_{i}^{(\tau)}\left( {m,n,q} \right)}}}}} \end{matrix}l} = 1},2,\cdots \quad,{{L - 1};}} \right. & (14) \\ {{R_{\tau}\left( {i,l} \right)} = \left\{ {\begin{matrix} {\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{{\hat{s}}_{1}^{(\tau)}\left( {m,n,q} \right)}{s_{l}^{(\tau)}\left( {m,n,q} \right)}}}} & {{{\text{for}\quad i} < l},{l = 1},2,\cdots \quad,{{L - 1};}} \\ 0 & \text{otherwise} \end{matrix}`\text{and}} \right.} & (15) \\ \left\{ {{{\begin{matrix} {{{\hat{p}}_{\tau}^{2}(0)} = {{\hat{p}}_{\tau}^{2}(0)}} \\ {{{\hat{p}}_{\tau}^{2}(l)} = {{p_{\tau}^{2}(l)} - {\sum\limits_{i = 0}^{l - 1}{{R_{\tau}^{2}\left( {i,l} \right)}\frac{{\hat{\sigma}}_{i}^{2}}{2N_{0}W}}}}} \end{matrix}\quad l} = 1},2,\cdots \quad,{L - 1.}} \right. & (16) \end{matrix}$

[0094] When the multi-paths do not interfere with each other, i.e. when Σ_(n=0) ^(N) ^(_(c)) ⁻¹Σ_(q=0) ¹s_(l) ^((τ))(m,n,q)s_(l) ^((τ))(m,n,q)=0 for i≠l, the optimal, one-shot timing estimator without channel information, is simplified to be: $\begin{matrix} \begin{matrix} {{{\hat{\tau}}_{non}(m)} = \quad {\arg \quad {\max\limits_{\tau \in {\lbrack{O,T})}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r\left( {m,n,q} \right)}{s_{l}^{(\tau)}\left( {m,n,q} \right)}}}}}^{2}\sigma_{l}^{2}}}}}} \\ {\quad {\arg \quad {\max\limits_{\tau \in {\lbrack{0,T})}}{\sum\limits_{l = 0}^{L - 1}{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r\left( {m,n,q} \right)}{b\left( {m - \alpha_{l,n,q}} \right)}{d\left( \left( {n - \beta_{l,q}} \right)_{N_{c}} \right)}}}}}}}}} \\ {{\quad {p_{rx}\left( \left( {{\left( {q - 1} \right)\frac{T_{c}}{2}} - \tau} \right)_{T_{c}} \right)}}^{2}{\sigma_{l}^{2}.}} \end{matrix} & (17) \end{matrix}$

[0095] In the timing estimation with channel information described in equation (8), the received sequence, r(m,n,q), was matched with the candidate sequence, ${\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{\rho}}_{l}{b\left( {m - \alpha_{l,n,q}} \right)}{d\left( \left( {n - \beta_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - l} \right)\quad \frac{T_{c}}{2}} - \tau} \right)_{T_{c}} \right)}}},$

[0096] which was generated from a knowledge of the channel information, {tilde over (ρ)}_(l), and the timing candidate, τ. However, unlike the fine matching in equation (8), in equation (17), there is a lack of channel information. Therefore, in equation (17), the coarse matching without channel information, of the received sequence, r(m,n,q), to the candidate, ${{b\left( {m - \alpha_{l,n,q}} \right)}{d\left( \left( {n - \beta_{l,q}} \right)_{N_{c}} \right)}{p_{rx}\left( \left( {{\left( {q - l} \right)\frac{T_{c}}{2}} - \tau} \right)_{T_{c}} \right)}},$

[0097] is performed and the results linearly combined according to the received energy on each multi-path, at least when the multi-paths do not interfere with one another.

[0098]FIG. 2 is a block diagram of an embodiment of an optimal, one-shot, data-aided timing estimation without channel information. When the multi-paths do interfere with one another, the optimal, one-shot timing estimation is modified to produce equation (10), where {ŝ_(l) ⁽⁹⁶ ⁾(m,n,q)|l=0,1, . . . ,L−1 } can be regarded as the interference-free representation of {s_(l) ^((τ))(m,n,q)|l=0,1, . . . ,L−1}.

[0099] The inventors conducted a series of experiments, each comprised of several simulations. The experiments illustrate the performance of multi-path channels with various delay spreads, and verify the performance of the proposed timing estimator. As in the experiment in the previous subsection, a “binary phase-shift keying” (BPSK) modulated signal was used, spread by the Barker sequence of length 11 over the multi-path channels as employed in IEEE 802.11b.

[0100]FIG. 3 is a graph that shows the simulation results for the first simulation: optimal timing estimation over multi-path, fading channels. As shown in the figure, when using a multi-path combination to mitigate channel fading impairment, the channel with the largest delay spread outperforms those with smaller delay spreads. It is worth noting that when channel information is known, this result coincides with that shown in FIG. 1.

[0101] Unfortunately, there is a natural weakness in this optimal timing estimation without channel information. The estimator is unable to provide the received time when it uses a large number, L, of receiving rays in the multi-path channel with a long delay spread. The receiving rays are the considered multi-paths on the receiving side. The number of receiving rays is usually smaller than the total number of multi-paths in the channel.

[0102]FIG. 4 shows examples that demonstrate the unfeasibility of timing estimation when receiving with a large L, over a long delay spread channel. This deficiency in optimal timing estimation without channel information, can be explained as follows: Since the optimal timing estimation with unknown channel information merely collects the energy in the multi-paths according to the received sequence, it can not identify the beginning of the received symbol when it uses a large number of receiving rays in multi-path channels with a long delay spread.

[0103] However, because of the fast power degradation of long delay spread multi-paths, it is reasonable to ignore these multi-paths. Therefore, a reasonable compromise is to choose, a priori, the number, L, of receiving rays. However, in selecting a suitable number of receiving rays, it is important to keep in mind that choosing too large an L may lead to a degradation of the ability to lock onto the received time, and choosing too small an L means that since multi-paths, l, for l≧L, are ignored, there will be a degradation in performance.

[0104]FIG. 5 is a graph that shows the simulation results of the second simulation, and compares the performance differences between optimal timing estimation with and without channel information. This experiment uses the same parameters as the previous one except that the number of timing candidates per chip is now 4, and a raised cosine pulse with a roll-off factor of 1 is the received pulse, ρ_(rx)(t).

[0105] The results shown in the figure lead to an important conclusion: the performance gain due to known channel information is much greater in channels with larger delay spreads.

[0106]FIG. 6 is a graph that shows the simulation results of the third and last simulation in this subsection: optimal timing estimation without channel information. They show the performances for multi-path channels with delay spreads of up to 300 nsec. The simulation parameters are similar to those in the second experiment, except that the number of maximal receiving rays is 11. Note that the figure shows optimal timing estimation without channel information. The timing estimation error for a 300 nsec delay spread is less than 0.45 chips, which is good enough for any succeeding blocks such as the tracking algorithms.

[0107] (c) Optimal Joint Timing Estimation And Differential Detection With Unknown Channel Information And An Unknown Received Information Sequence

[0108] In Subsection 2 (b), only the first assumption—known received amplitudes and carrier phases—made in Subsection 2 (a), was relaxed, in order to introduce the optimal timing estimation without channel information. In this subsection, both assumptions are relaxed, to disclose the optimal timing estimation with both unknown channel information and unknown received information bits. This scheme also detects phase variation in contiguous symbols, simultaneously.

[0109] When the received information sequence is unknown to the timing estimator, the optimal, one-shot, timing estimation based on the MAP criterion is: $\begin{matrix} {{{\hat{\tau}}_{bld}(m)} = {\arg \quad {\max\limits_{{\tau \in {\lbrack{o,T})}}{{b{(0)}} \in {\pm 1}}{{b{(1)}} \in {\pm 1}}\vdots {{b{({M - 1})}} \in {\pm 1}}}{{\Pr \left( {\left. {r\left( {m,n,q} \right)} \middle| \tau \right.,{b(0)},{b(1)},\quad \cdots,{b\left( {M - 1} \right)}} \right)}.}}}} & (18) \end{matrix}$

[0110] The complexity of this estimation grows exponentially as a function of the number, M, of transmitted information bits.

[0111] Fortunately, in the one-shot, timing estimation, not all of the M symbols are related to the timing estimation in the mth symbol. For example, for the modest goal of resolving the multi-paths within a symbol duration, the only information bits affecting the timing estimation in the mth symbol are b(m), b(m−1), and b(m−2).

[0112] As discussed in Subsection 2 (b), due to the nature of timing estimation without channel information in multi-path channels, trying to resolve too many multi-paths degrades the performance. Therefore, it is reasonable to ignore the presence of multi-paths beyond a pre-specified symbol. In addition, because there is an absolute value operation in the optimal timing estimation without channel information, as seen in equation (19) below, the number of combinations of received information bits is further reduced from 8 to 4. $\begin{matrix} \begin{matrix} {{\hat{\tau}}_{bld} = \quad {\arg \quad {\max\limits_{{\tau \in {\lbrack{0,T})}}{{({{b{(m)}},{b{({m - 1})}},{b{({m - 2})}}})} \in {\{{{({{- 1},{- 1},{- 1}})}{({{- 1},{- 1},1})}{({{- 1},1,{- 1}})}{({{- 1},1,1})}}\}}}}{\Pr \left( {\left. {r\left( {m,n,q} \right)} \middle| \tau \right.,{b(m)},{b\left( {m - 1} \right)},\quad {b\left( {m - 2} \right)}} \right)}}}} \\ {= \quad {\arg \quad {\max\limits_{{\tau \in {\lbrack{0,T})}}{{({{b{(m)}},{b{({m - 1})}},{b{({m - 2})}}})} \in {\{{{({{- 1},{- 1},{- 1}})}{({{- 1},{- 1},1})}{({{- 1},1,{- 1}})}{({{- 1},1,1})}}\}}}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r\left( {m,n,q} \right)}{{\hat{s}}_{l}^{(\tau)}\left( {m,n,q} \right)}}}}}^{2}{\hat{\sigma}}_{l}^{2}}}}}} \end{matrix} & (19) \end{matrix}$

[0113]FIG. 7 includes a block diagram for optimal, one-shot timing estimation with unknown channel information and received bits. This estimation requires a bank of 4NL correlators, where N is the number of timing candidates and L is the number of receiving rays. In fact, the number of distinct correlators shown in the figure is $4{\left( {N + \frac{N\left( {L - 1} \right)}{22}} \right).}$

[0114]FIG. 8 plots the results of a series of simulations conducted by the inventors, that demonstrate the effectiveness of this timing estimation. The performance degradation due to unknown received information bits is around 2 to 3 dB.

[0115] 3. Sub-Optimal Timing Estimation of DSSS Communications Systems Over Frequency-Selective, Slowly Fading Channels

[0116] Various optimal timing estimations based on the MAP criterion were disclosed in the previous section. In the present section a sub-optimal timing estimator with unknown channel information and unknown received information bits is disclosed. This new estimator is a simplification of the earlier optimal estimators discussed above, making it easier to use in practical applications.

[0117] (a) A Simplified Realization

[0118] The disclosed optimal timing estimation of Section 2 required a bank of 4NL correlators, where the factor of 4 came from the four possible combinations of the three symbols b(m), b(m−1), and b(m−2) that affect the timing estimation of the mth symbol. As discussed in Subsection 2 (c), although there are eight possible combinations, this number is reduced to four because of the absolute value operation in equation (19). Therefore, if the received time lies in the interval [0,T/2), and if the multi-paths for lT_(c)/2>T/2 are ignored, then the information symbols which affect the timing estimate, {circumflex over (τ)}_(bid)(m), are b(m) and b(m−1), and the number of correlators required for the timing estimation is reduced to 2NL. FIG. 9 is a conceptual plot of a simplified, non-data-aided timing estimation. FIG. 10 is a block diagram of a simplified realization of an optimal, one-shot, joint differential detection and timing estimation, without channel information.

[0119] The important lesson to be learned from this simplified structure is found in the serial implementation of the timing estimation. Since the upper and lower filter banks are identical, one of the filter banks can be ignored. This simplification comes from splitting the received timing into the two subintervals, [0,T/2) and [T/2,T).

[0120] Even further simplification is possible. When the number of timing candidates is twice that of the spread gain, N, which is the same as the number of samples per symbol, the received timing can be further split into the half-open subintervals, {[IT_(c)/2,(l+1)T_(c)/2)l=0,1, . . . ,N_(c)−1}.

[0121] In the following subsections, two sub-optimal timing estimators are disclosed: one with 2L-correlators and one with 1-correlator. To simplify the discussion of these two estimators, it is assumed that the number, N, of timing candidates, is equal to the number of samples per symbol. Nevertheless, both estimators are equally applicable when this assumption is relaxed.

[0122] (b) The 2L-correlators Realization

[0123] The optimal, data-aided, one-shot timing estimation without channel information is: $\begin{matrix} \begin{matrix} {{{\hat{\tau}}_{non}(m)} = \quad {\arg \quad {\max\limits_{\tau \in {\lbrack{0,T})}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r\left( {m,n,q} \right)}{{\hat{s}}_{l}^{(\tau)}\left( {m,n,q} \right)}}}}}^{2}{\hat{\sigma}}_{l}^{2}}}}}} \\ {= \quad {\arg \quad {\max\limits_{\tau \in {\{{{{{\quad {T_{c}/2}}|i} = 0},1,\cdots,{{2N_{c}} - 1}}\}}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r_{LP}\left( {{m\quad T} + {n\quad T_{c}} + {q\quad \frac{T_{c}}{2}}} \right)}{{\hat{s}}_{l}^{(\tau)}\left( {m,n,q} \right)}}}}}^{2}{\hat{\sigma}}_{l}^{2}}}}}} \\ {\cong \quad {\arg \quad {\max\limits_{\tau \in {\{{{{{\quad {T_{c}/2}}|i} = 0},1,\cdots,{{2N_{c}} - 1}}\}}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r_{LP}\left( {{m\quad T} + {n\quad T_{c}} + {q\quad \frac{T_{c}}{2}} + \tau} \right)}{{\hat{s}}_{l}^{(0)}\left( {m,n,q} \right)}}}}}^{2}{{\hat{\sigma}}_{l}^{2}.}}}}}} \end{matrix} & (20) \end{matrix}$

[0124] Therefore, the 2N_(c) timing candidates share the same filter bank with the 2L-correlators. When the received information bits are unknown to the estimator, the timing estimator becomes $\begin{matrix} {{{\hat{\tau}}_{2L}(m)} = {\arg \quad {\max\limits_{{\tau \in {\{{{{{i\quad {T_{c}/2}}|i} = 0},1,\cdots,{{2N_{c}} - 1}}\}}}{{({{b{(m)}},{b{({m - 1})}}})} \in {\{{{({{- 1},{- 1}})},{({{- 1},1})}}\}}}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r_{LP}\left( {{m\quad T} + {n\quad T_{c}} + {q\quad \frac{T_{c}}{2}} + \tau} \right)}{{\hat{s}}_{l}^{(0)}\left( {m,n,q} \right)}}}}}^{2}{\hat{\sigma}}_{l}^{2}}}}}} & (21) \end{matrix}$

[0125]FIG. 11 is a block diagram of a sub-optimal timing estimator with 2L, 22-taps, finite impulse response (FIR) filters. It is remarkable that these FIR filters do not contain multiplication operations when the employed signature sequence is binary-valued, such as, for example, the Barker sequence in IEEE 802.11b.

[0126] (c) The 1-correlator Realization

[0127] A further simplified estimator can be obtained by approximating {circumflex over (τ)}_(2L)(m) as: $\begin{matrix} \begin{matrix} {{{\hat{\tau}}_{2L}(m)} \simeq \quad {\arg \quad {\max\limits_{\tau \in {\{{{{{i\quad {T_{c}/2}}|i} = 0},1,\cdots,{{2N_{c}} - 1}}\}}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r_{LP}\left( {{m\quad T} + {n\quad T_{c}} + {q\quad \frac{T_{c}}{2}} + \tau + {l\quad \frac{T_{c}}{2}}} \right)}{d(n)}}}}}^{2}{\hat{\sigma}}_{l}^{2}}}}}} \\ {\simeq \quad {\arg \quad {\max\limits_{\tau \in {\{{{{{i\quad {T_{c}/2}}|i} = 0},1,\cdots,{{2N_{c}} - 1}}\}}}{\sum\limits_{l = 0}^{L - 1}{{{\sum\limits_{n = 0}^{N_{c} - 1}{\sum\limits_{q = 0}^{1}{{r_{LP}\left( {{m\quad T} + {n\quad T_{c}} + {q\quad \frac{T_{c}}{2}} + \tau + {l\quad \frac{T_{c}}{2}}} \right)}{d(n)}}}}}^{2}\gamma_{l}}}}}} \\ {{\equiv \quad {{\hat{\tau}}_{sub}(m)}},} \end{matrix} & (22) \end{matrix}$

[0128] where the γ_(l) for l=0,1, . . . ,L−1, are some constants that are assigned when ${{\frac{{\hat{\sigma}}_{l}^{2}}{2N_{0}W} \equiv \frac{\frac{\sigma_{l}^{2}}{2N_{0}W}}{1 + {{{\hat{p}}_{\tau}^{2}(l)}\frac{\sigma_{l}^{2}}{2N_{0}W}}}} = \frac{{SNR}_{l}}{1 + {{{\hat{p}}_{\tau}^{2}(l)}{SNR}_{l}}}},$

[0129] and which depend on the signal to noise ratio in each multi-path, and are not known beforehand. In fact, these parameters do not degrade the performance much at all. Therefore the reference parameters determined experimentally through the simulations discussed below, can be used.

[0130]FIG. 12 is a block diagram of a sub-optimal, one-shot timing estimator, without channel information, but with a 1-correlator, and $\gamma_{l} = {\frac{\sigma_{l}^{2}}{{2N_{0}W} + {{{\hat{p}}_{\tau}^{2}(l)}\sigma_{l}^{2}}}.}$

[0131] This timing estimator only needs a 22-taps, multiplication-free, FIR filter.

[0132] (d) Simulations

[0133] The inventors conducted simulations to test the effectiveness of these sub-optimal timing estimators. The received information bits were assumed to be binary-valued, but unknown to the estimators. In addition, the information bits were spread by a Barker sequence of length 11, and were transmitted over the frequency-selective, slowly fading channels with models suggested in IEEE 802.11b. However, this channel information was unknown to the estimator.

[0134] The received signal was sampled twice per chip and the number of timing candidates was 2N_(c)=22. The received pulse, ρ_(rx)(t), was a raised cosine function with a roll-off factor of 1.

[0135] The graph in FIG. 13 demonstrates the effectiveness of the disclosed 2L-correlators and 1-correlator timing estimators. It is particularly significant that the estimation errors of both one-shot estimators are less than 0.5 chips when the signal-to-noise ratio (SNR) is larger than 20 dB.

[0136] Moreover, both estimators are robust with respect to any frequency offset impairment caused by the Doppler effect, fading channel effects, and imperfect oscillators. The simulations support the conclusion that this robustness of the estimators is inherited from the timing estimation with unknown carrier phases.

[0137] The graphs in FIG. 14 and FIG. 15 demonstrate the robustness of these estimators to a carrier phase rotation of Π/8 per symbol.

[0138] 4. Conclusions

[0139] Although frequency diversity and multi-path interference are both caused by the frequency-selective channel, they affect wireless communications systems in different ways. For on the one hand, by using the frequency diversity induced by frequency-selective channels, not only can channel fading impairment be fixed, multi-path interference can also be mitigated. On the other hand, by ignoring the interference caused by multi-paths, the system suffers both channel fading impairment and performance degradation due to interference.

[0140] This principle applies not only in the detection of frequency-selective, fading channels, but also in timing estimation, as has been established in this disclosure.

[0141] This disclosure began with a derivation of the optimal timing estimation based on the application of the MAP criterion to frequency-selective, slowly fading channels with known channel information and known received information bits. This result was later generalized to the optimal timing estimation with unknown channel information, first with known and then with unknown received information bits.

[0142] Next, the effective, sub-optimal, timing estimator with only a 22-taps, multiplication-free, FIR filter was disclosed. The extremely practical nature of this sub-optimal estimator was demonstrated through simulations. Moreover, this timing estimator was shown to be robust with respect to frequency offset impairment.

[0143] When estimating the received time without channel information, instead of trying to perfectly match the received signal with the locally generated signal, the optimal estimation actually collects the received energy on the multi-paths. Therefore, the natural limitation of timing estimation to multi-path channels with long delay spreads dominates the performance when the channel information is unknown beforehand.

[0144] This leads to the following strategy for synchronization over frequency-selective, fading channels. For a multi-path channel with a short delay spread, first estimate the received timing without channel information, and then estimate the received carrier phases and amplitudes on the multi-paths based on this timing estimate. On the other hand, for a channel with a long delay spread, the first step should be to estimate the received carrier phases and amplitudes of the multi-paths.

[0145] It is particularly significant that the assumption of a time-invariant channel over M symbols can easily be relaxed. Because of the nature of one-shot estimation, this assumption relaxation is equally applicable to the one-shot setting as long as the channel is time-invariant within a symbol duration. In addition, the timing estimate for M symbols can also be derived by simply accumulating the decision statistics on the one-shot estimation.

[0146] Finally, these proposed timing estimators are not limited to DSSS communications systems. They can be applied to the more general setting of generalized signature sequences.

[0147] It should be understood that the foregoing relates only to certain embodiments of the present invention, and that numerous changes and modifications may be made without departing from the spirit and scope of the invention as defined in the following claims. 

1. A method for estimating the received time of a received signal transmitted over frequency-selective, fading communications channels, wherein the received signal contains channel information and a training sequence, and wherein the channel parameters include the received amplitudes and carrier phases of at least one of the multi-path components, comprising: receiving the received signal; determining the training sequence of the received signal; and determining the received time by a composite hypothesis test in which the likelihood function over the unknown parameters is averaged, and then a timing candidate with maximal likelihood is chosen.
 2. The method of claim 1, wherein the composite hypothesis test employs a maximum, a posteriori, probability criterion that is used to determine the received time by first averaging the likelihood function over the unknown parameters, and then choosing a timing candidate with maximal likelihood.
 3. The method of claim 1, wherein the received signal is transmitted by a direct sequence, spread spectrum communications system.
 4. The method of claim 1, wherein the channel information, including the amplitudes and carrier phases of the multi-path channels, is known by the receiver.
 5. The method of claim 1, wherein the channel information, including the amplitudes and carrier phases of the multi-path channels, is unknown to the receiver.
 6. The method of claim 1, wherein the training sequence is known by the receiver.
 7. The method of claim 1, wherein the training sequence is unknown to the receiver.
 8. The method of claim 1, wherein the received signal is a continuous time signal.
 9. The method of claim 1, wherein the received signal is a discrete time signal.
 10. The method of claim 1, wherein the step of determining the timing estimate includes using k-taps finite impulse response filters to estimate the received time.
 11. The method of claim 10 wherein k equals 22 when a Barker sequence of length 11 is used.
 12. The method of claim 1, wherein the step of determining the timing estimate includes using correlators to estimate the received time.
 13. The method of claim 1, wherein the step of determining the time estimate includes using a k-taps, multiplication-free finite impulse response filter to estimate the received time.
 14. The method of claim 13 wherein k equals 22 when a Barker sequence of length 11 is used.
 15. The method of claim 1, wherein the step of determining the timing estimate includes using a 1-correlator to estimate the received time.
 16. The method of claim 2, wherein the received Jets signal is transmitted by a direct sequence, spread spectrum communications system.
 17. The method of claim 2, wherein the channel information, including the amplitudes and carrier phases of the multi-path channels, is known by the receiver.
 18. The method of claim 2, wherein the channel information, including the amplitudes and carrier phases of the multi-path channels, is unknown to the receiver.
 19. The method of claim 2, wherein the training sequence is known by the receiver.
 20. The method of claim 2, wherein the training sequence is unknown to the receiver.
 21. The method of claim 2, wherein the received signal is a continuous time signal.
 22. The method of claim 2, wherein the received signal is a discrete time signal.
 23. The method of claim 2, wherein the step of determining the timing estimate includes using k-taps finite impulse response filters to estimate the received time.
 24. The method of claim 23 wherein k equals 22 when a Barker sequence of length 11 is used.
 25. The method of claim 2, wherein the step of determining the timing estimate includes using correlators to estimate the received time.
 26. The method of claim 2, wherein the step of determining the time estimate includes using a k-taps, multiplication-free finite impulse response filter to estimate the received time.
 27. The method of claim 26 wherein k equals 22 when a Barker sequence of length 11 is used.
 28. The method of claim 2, wherein the step of determining the timing estimate includes using a 1-correlator to estimate the received time.
 29. The method of claim 2, wherein the step of determining the time estimate comprises: correlating the received signal with at least one locally generated signal to form a correlated output signal, wherein the locally generated signal relates to at least one timing candidate and at least one multi-path component; generating a plurality of real-valued outputs from the correlated outputs, based on the energy of the correlated outputs; linearly combining the real-valued outputs to form a plurality of linear combination outputs, so that each of the linear combination outputs corresponds to one of the timing candidates; determining a linear combination output with maximal value; and choosing the timing candidate corresponding to the maximal linear combination output, so that the energy of the correlated outputs is maximized.
 30. The method of claim 2, wherein the step of determining the timing estimate includes using a joint received timing and training sequence estimator to determine the timing estimate and information sequence.
 31. The method of claim 2, wherein the channel has a long delay spread, and wherein the step of determining the timing estimate comprises: estimating the received carrier phases and amplitudes of the multi-paths; estimating the received time by correlating the received signal with at least one locally generated signal to form a correlated output signal, wherein the locally generated signal relates to at least one timing candidate and at least one multi-path component; generating a plurality of real-valued outputs from the correlated outputs based on the energy of the correlated outputs; linearly combining the real-valued outputs to form a plurality of linear combination outputs, so that each of the linear combination outputs corresponds to one of the timing candidates; determining a linear combination output with maximal value; and choosing the timing candidate corresponding to the maximal linear combination output, so that the energy of the correlated outputs is maximized.
 32. The method of claim 2, wherein the channel has a short delay spread, and wherein the step of determining the timing estimate comprises: estimating the received time by correlating the received signal with at least one locally generated signal to form a correlated output signal, wherein the locally generated signal relates to at least one timing candidate and at least one multi-path component; generating a plurality of real-valued outputs from the correlated outputs based on the energy of the correlated outputs; linearly combining the real-valued outputs to form a plurality of linear combination outputs, so that each of the linear combination outputs corresponds to one of the timing candidates; determining a linear combination output with maximal value; choosing the timing candidate corresponding to the maximal linear combination output, so that the energy of the correlated outputs is maximized; and estimating the received carrier phases and amplitudes of the multi-paths.
 33. The method of claim 3, wherein the channel information, including the amplitudes and carrier phases of the multi-path channels, is known by the receiver.
 34. The method of claim 3, wherein the channel information, including the amplitudes and carrier phases of the multi-path channels, is unknown to the receiver.
 35. The method of claim 3, wherein the training sequence is known by the receiver.
 36. The method of claim 3, wherein the training sequence is unknown to the receiver.
 37. The method of claim 3, wherein the received signal is a continuous time signal.
 38. The method of claim 3, wherein the received signal is a discrete time signal.
 39. The method of claim 3, wherein the step of determining the timing estimate includes using k-taps finite impulse response filters to estimate the received time.
 40. The method of claim 39 wherein k equals 22 when a Barker sequence of length 11 is used.
 41. The method of claim 3, wherein the step of determining the timing estimate includes using correlators to estimate the received time.
 42. The method of claim 3, wherein the step of determining the time estimate includes using a k-taps, multiplication-free finite impulse response filter to estimate the received time.
 43. The method of claim 42 wherein k equals 22 when a Barker sequence of length 11 is used.
 44. The method of claim 3, wherein the step of determining the timing estimate includes using a 1-correlator to estimate the received time.
 45. The method of claim 4, wherein the training sequence is known by the receiver.
 46. The method of claim 4, wherein the training sequence is unknown to the receiver.
 47. The method of claim 4, wherein the received signal is a continuous time signal.
 48. The method of claim 4, wherein the received signal is a discrete time signal.
 49. The method of claim 4, wherein the step of determining the timing estimate includes using k-taps finite impulse response filters to estimate the received time.
 50. The method of claim 49 wherein k equals 22 when a Barker sequence of length 11 is used.
 51. The method of claim 4, wherein the step of determining the timing estimate includes using correlators to PRO estimate the received time.
 52. The method of claim 4, wherein the step of determining the time estimate includes using a k-taps, multiplication-free finite impulse response filter to estimate the received time.
 53. The method of claim 52 wherein k equals 22 when a Barker sequence of length 11 is used.
 54. The method of claim 4, wherein the step of determining the timing estimate includes using a 1-correlator to estimate the received time.
 55. The method of claim 5, wherein the training sequence is known by the receiver.
 56. The method of claim 5, wherein the training sequence is unknown to the receiver.
 57. The method of claim 5, wherein the received signal is a continuous time signal.
 58. The method of claim 5, wherein the received signal is a discrete time signal.
 59. The method of claim 5, wherein the step of determining the timing estimate includes using k-taps finite impulse response filters to estimate the received time.
 60. The method of claim 59 wherein k equals 22 when a Barker sequence of length 11 is used.
 61. The method of claim 5, wherein the step of determining the timing estimate includes using correlators to estimate the received time.
 62. The method of claim 5, wherein the step of determining the time estimate includes using a k-taps, multiplication-free finite impulse response filter to estimate the received time.
 63. The method of claim 62 wherein k equals 22 when a Barker sequence of length 11 is used.
 64. The method of claim 5, wherein the step of determining the timing estimate includes using a 1-correlator to estimate the received time.
 65. The method of claim 28 wherein the correlating step comprises: canceling the contribution of the correlation caused by the multi-path components for each timing candidate.
 66. The method of claim 28, wherein the step of correlating the received signal with at least one locally generated signal to form a correlated output signal comprises: generating a plurality of delayed received signals; and correlating the plurality of delayed received signals with the plurality of locally generated signals.
 67. The method of claim 29 wherein the energy is the square sum of the signal magnitude within a symbol.
 68. The method of claim 29 wherein the energy is the sum of the signal magnitude within a symbol.
 69. The method of claim 30 wherein the step of determining the timing estimate further comprises: correlating the received signal with at least one locally generated signal to form a correlated output signal, wherein the locally generated signal relates to at least one timing candidate, at least one multi-path component, and at least one training sequence pattern; generating a plurality of real-valued outputs from the correlated outputs based on the energy of the correlated outputs; linearly combining the real-valued outputs to form a plurality of linear combination outputs, so that each of the linear combination outputs corresponds to one of the timing candidates; determining a linear combination output with maximal value; and choosing the timing candidate corresponding to the maximal linear combination output, so that the energy of the correlated outputs is maximized.
 70. The method of claim 31 wherein the energy is the real part of the correlated output.
 71. The method of claim 31 wherein the correlating step comprises: canceling the contribution of the correlation caused by the multi-path components for each timing candidate.
 72. The method of claim 31, wherein the step of correlating the received signal with at least one locally generated signal to form a correlated output signal comprises: generating a plurality of delayed received signals; and correlating the plurality of delayed received signals with the plurality of locally generated signals.
 73. The method of claim 32 wherein the energy is the square sum of the signal magnitude within a symbol.
 74. The method of claim 32 wherein the energy is the sum of the signal magnitude within a symbol.
 75. The method of claim 32 wherein the correlating step comprises: canceling the contribution of the correlation caused by the multi-path components for each timing candidate.
 76. The method of claim 32, wherein the step of correlating the received signal with at least one locally generated signal to form a correlated output signal comprises: generating a plurality of delayed received signals; and correlating the plurality of delayed received signals with the plurality of locally generated signals.
 77. The method of claim 67 wherein the correlating step comprises: canceling the contribution of the correlation caused by the multi-path components for each timing candidate.
 78. The method of claim 67, wherein the step of correlating the received signal with at least one locally generated signal to form a correlated output signal comprises: generating a plurality of delayed received signals; and correlating the plurality of delayed received signals with the plurality of locally generated signals.
 79. The method of claim 68 wherein the correlating step comprises: canceling the contribution of the correlation caused by the multi-path components for each timing candidate.
 80. The method of claim 68, wherein the step of correlating the received signal with at least one locally generated signal to form a correlated output signal comprises: generating a plurality of delayed received signals; and correlating the plurality of delayed received signals with the plurality of locally generated signals.
 81. The method of claim 69 wherein the correlating step comprises: canceling the contribution of the correlation caused by the multi-path components for each timing candidate.
 82. An apparatus for estimating the received time of a received signal that is transmitted over a frequency-selective fading communications channel, comprising: a plurality of finite impulse response filters for correlating the received signal with a plurality of locally generated signals to form a correlated output signal, wherein the locally generated signals relate to at least one multi-path component; a linear combination block coupled to the finite impulse response filters, to linearly combine the correlated output signals to form a combination output; a set of storage components into which the combination outputs are stored; and a selector coupled to the storage components, that determines the received time estimate by finding a candidate with maximal energy, and estimating the received time as the time of the candidate with maximal energy.
 83. The apparatus of claim 82, wherein the received signal comprises channel information and a training sequence.
 84. The apparatus of claim 82, wherein the received signal comprises channel information.
 85. The apparatus of claim 82, wherein the linear combination block further comprises a means to cancel a plurality of correlation contributions from a plurality of multi-path components.
 86. The apparatus of claim 82, wherein the linear combination block further comprises a means for calculating the energy of the correlated output signal. 